PAT 1147. Heaps (30) | 您所在的位置:网站首页 › heaps of用法 › PAT 1147. Heaps (30) |
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree. (Quoted from Wikipedia at https://en.wikipedia.org/wiki/Heap_(data_structure))Your job is to tell if a given complete binary tree is a heap. Input Specification: Each input file contains one test case. For each case, the first line gives two positive integers: M ( |
CopyRight 2018-2019 实验室设备网 版权所有 |